Global Expectation-Violation as Fitness Function in Evolutionary Composition
نویسندگان
چکیده
Previous approaches to Common Practice Period style automated composition – such as Markov models and Context-Free Grammars (CFGs) – do not well characterise global, context-sensitive structure of musical tension and release. Using local musical expectation violation as a measure of tension, we show how global tension structure may be extracted from a source composition and used in a fitness function. We demonstrate the use of such a fitness function in an evolutionary algorithm for a highly constrained task of composition from pre-determined musical fragments. Evaluation shows an automated composition to be effectively indistinguishable from a similarly constrained composition by an experienced composer.
منابع مشابه
PMU Placement Methods in Power Systems based on Evolutionary Algorithms and GPS Receiver
In this paper, optimal placement of Phasor Measurement Unit (PMU) using Global Positioning System (GPS) is discussed. Ant Colony Optimization (ACO), Simulated Annealing (SA), Particle Swarm Optimization (PSO) and Genetic Algorithm (GA) are used for this problem. Pheromone evaporation coefficient and the probability of moving from state x to state y by ant are introduced into the ACO. The modifi...
متن کاملEvolutionary algorithms - how to cope with plateaus of constant fitness and when to reject strings of the same fitness
The most simple evolutionary algorithm, the so-called (1+1)EA accepts a child if its fitness is at least as large (in the case of maximization) as the fitness of its parent. The variant (1 + 1)∗EA only accepts a child if its fitness is strictly larger than the fitness of its parent. Here two functions related to the class of long path functions are presented such that the (1 + 1)EA maximizes on...
متن کاملDesign and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods Evolutionary Algorithms - How to Cope With Plateaus of Constant Fitness and When to Reject Strings of the Same Fitness
The most simple evolutionary algorithm, the so-called (1+1)EA accepts a child if its fitness is at least as large (in the case of maximization) as the fitness of its parent. The variant (1 + 1)∗EA only accepts a child if its fitness is strictly larger than the fitness of its parent. Here two functions related to the class of long path functions are presented such that the (1 + 1)EA maximizes on...
متن کاملRadiation Hormesis: an Evolutionary Expectation Invalidating the Linear No-threshold (lnt) Premise
Organisms survive best, or show high fitness, in the habitats in which they most commonly occur, a phenomenon referred to as hormesis in the literature of toxicology. Examples of hormesis accumulate rapidly in the literature. However, a lack of underlying models has led many to doubt its existence, especially for ionizing radiation. The evolutionary model developed here indicates that all poten...
متن کاملSolving constrained optimization problems via Subset Simulation
This paper extends the application of Subset Simulation (SS), an advanced Monte Carlo algorithm for reliability analysis, to solve constrained optimization problems encountered in engineering. The proposed algorithm is based on the idea that an extreme event (optimization problem) can be considered as a rare event (reliability problem). The Subset Simulation algorithm for optimization is a popu...
متن کامل